Path Planning of Mobile Robots Based on QR Code
نویسندگان
چکیده
منابع مشابه
Local path planning for mobile robots based on intermediate objectives
This paper presents a path planning algorithm for autonomous navigation of non-holonomic mobile robots in complex environments. The irregular contour of obstacles is represented by segments. The goal of the robot is to move towards a known target while avoiding obstacles. The velocity constraints, robot kinematic model and non-holonomic constraint are considered in the problem. The optimal path...
متن کاملPath Planning for Mobile Robots Based on Hybrid Architecture Platform
In this paper, a hybrid architecture is used to develop the software platform of path planning of mobile robots. It consists of four levels: the decision-making layer, the behavior layer, the command parsing layer and the hardware communication layer. The whole framework of the decision-making system is based on the global planning, which is realized by using the ant colony algorithm. In the pr...
متن کاملPSO-Based Path Planning Algorithm for Humanoid Robots Considering Safety
In this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses Ferguson splines and PSO (Particle Swarm Optimization). The objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. Ferguson splines create preliminary paths using random generated para...
متن کاملNeural Networks Based Path Planning and Navigation of Mobile Robots
The path planning for mobile robots is a fundamental issue in the field of unmanned vehicles control. The purpose of the path planner is to compute a path from the start position of the vehicle to the goal to be reached. The primary concern of path planning is to compute collision-free paths. Another, equally important issue is to compute a realizable and, if possible, optimal path, bringing th...
متن کاملCellular Automata Based Path-planning Algorithm for Autonomous Mobile Robots
This paper presents the application of Cellular Automata (CA) model in solving the problem of path planning. It is shown that a CA allows the efficient computation of a path from an initial to a goal configuration on a physical space cluttered with obstacles. The cellular space represents a discrete version of the workspace. The method was experimentally tested on an autonomous mobile robot on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Academic Perspective Procedia
سال: 2018
ISSN: 2667-5862
DOI: 10.33793/acperpro.01.01.9